/*
 * Eugen Stoian <stoian.e@gmail.com> 2010
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 *
 */


#ifndef USERFUNTABLE_H
#define USERFUNTABLE_H
#include <ExpressionTreeNode.h>
#include <QHash>
#include <QStringList>

class UserFunTable
{
private:
    UserFunTable();
    static UserFunTable& instance();
public:
    static bool add(const QString& signature, const QStringList& varList, ExpressionTreeNode* tree);
    static void remove(const QString& signature);
    static ExpressionTreeNode* find(const QString& signature);
    static QStringList varList(const QString& signature);
private:
    struct FunInfo {
        FunInfo(const QStringList& varList = QStringList(),
                ExpressionTreeNode* tree = 0){
            _varList = varList;
            _tree = tree;
        }
        inline bool isValid() const{
            return _tree;
        }
        const QStringList& varList() const{
            return _varList;
        }
        const ExpressionTreeNode* tree() const{
            return _tree;
        }

        ExpressionTreeNode* tree(){
            return _tree;
        }
        QStringList _varList;
        ExpressionTreeNode *_tree;
    };
    QHash<QString,FunInfo> _funHash;

};

#endif // USERFUNTABLE_H
